Implementation of the Radon Transform Using Non-equispaced Discrete Fourier Transforms
نویسندگان
چکیده
This report discusses the implementation of the Radon transform in the Analysts’ Detection Support System (ADSS) environment using non-equispaced Discrete Fourier Transforms (DFTs). It provides an analysis and experimental results for discretisation error and the use of matched filtering to enhance peaks in the transform. APPROVED FOR PUBLIC RELEASE
منابع مشابه
Non-Equispaced Fast Fourier Transforms in Turbulence Simulation
NON-EQUISPACED FAST FOURIER TRANSFORMS IN TURBULENCE SIMULATION SEPTEMBER 2017 ADITYA MOHAN KULKARNI, B. E., UNIVERSITY OF PUNE M.S.M.E. UNIVERSITY OF MASSACHUSETTS AMHERST Directed by: Prof. Stephen de Bruyn Kops Fourier pseudo-spectral method is one of the approaches used to compute the derivative of a discrete data in Computational Fluid Dynamics. The Fourier transform of the data sampled on...
متن کاملCombining the Radon, Markov, and Stieltjes Transforms for Object Reconstruction
In shape reconstruction, the celebrated Fourier slice theorem plays an essential role. By virtue of the relation between the Radon transform, the Fourier transform and the 2-dimensional inverse Fourier transform, the shape of an object can be reconstructed from the knowledge of the object’s Radon transform. Unfortunately, a discrete implementation requires the use of interpolation techniques, s...
متن کاملInvariant pattern recognition using the RFM descriptor
A pattern descriptor invariant to rotation, scaling, translation (RST), and robust to additive noise is proposed by using the Radon, Fourier, and Mellin transforms. The Radon transform converts the RST transformations applied on a pattern into transformations in the radial and angular slices of the Radon transform data. These beneficial properties of the Radon transform make it an useful interm...
متن کاملFast Slant Stack : A notion of Radon Transform for Data in a Cartesian Grid which is
We define a notion of Radon Transform for data in an n by n grid. It is based on summation along lines of absolute slope less than 1 (as a function either of x or of y), with values at non-Cartesian locations defined using trigonometric interpolation on a zero-padded grid. The definition is geometrically faithful: the lines exhibit no 'wraparound effects'. For a special set of lines equispaced ...
متن کاملFast algorithms of multidimensional discrete nonseparable -wave transforms
Fast algorithms for a wide class of non–separable n–dimensional (nD) discrete unitary K– transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix–2 FFT–type approach. The method utilizes a decomposition of the nDK–transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K–transforms. If the nD K–transform has a s...
متن کامل